multi-objective and scalable heuristic algorithm for workflow task scheduling in utility grids

نویسندگان

vahid kahejvand

hossein pedram

mostafa zandieh

چکیده

to use services transparently in a distributed environment, the utility grids develop a cyber-infrastructure. the parameters of the quality of service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the utility grids. optimization of both target parameters above is a challenge in a distributed environment and may conflict one another. we, therefore, present a novel heuristic algorithm for scheduling a workflow application on utility grids. our proposed algorithm optimizes the allocation-cost and makespan in a scalable and very low runtime. the results of the wide-spread simulation indicate that the proposed algorithm is scalable against an increase in the application size and task parallelism of the application. the proposed algorithm effectively outperforms the current algorithms in terms of the allocation-cost, makespan and runtime scalability.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids

 To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...

متن کامل

A Novel Adapted Multi-objective Meta-heuristic Algorithm for a Flexible Bi-objective Scheduling Problem Based on Physics Theory

  We relax some assumptions of the traditional scheduling problem and suggest an adapted meta-heuristic algorithm to optimize efficient utilization of resources and quick response to demands simultaneously. We intend to bridge the existing gap between theory and real industrial scheduling assumptions (e.g., hot metal rolling industry, chemical and pharmaceutical industries). We adapt and evalua...

متن کامل

An algorithm for multi-objective job shop scheduling problem

Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...

متن کامل

Task Scheduling Strategies for Workflow based Applications in Grids

Many scientific computing tasks are too large to be processed quickly on one computer. Instead, the grid has become popular for a wide range of disciplines. Efficiently using the all the resources of the grid is a challenging, NP problem though. The authors introduced a new method for scheduling that accounted for data dependencies, a topic often ignored in job scheduling algorithms. They also ...

متن کامل

Task Scheduling Model Based on Multi-Agent and Multi-Objective Dynamical Scheduling Algorithm

With the increasing number of nodes in distributed systems, the complexity of task scheduling also increases. Therefore, how to schedule tasks reasonably is becoming more and more significant. Most traditional algorithms only consider a single condition without thinking over dynamic characteristic of system and tasks and lack of comprehensive measures. Therefore they cannot meet the needs of di...

متن کامل

an algorithm for multi-objective job shop scheduling problem

scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of optimization in industrial engineering

ناشر: qiau

ISSN 2251-9904

دوره 7

شماره 14 2014

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023